- vector matroid
- мат.векторный матроид
English-Russian scientific dictionary. 2008.
vector matroid
Смотреть что такое "vector matroid" в других словарях:
Matroid — In combinatorics, a branch of mathematics, a matroid ( /ˈmeɪ … Wikipedia
matroid — noun A structure that captures the essence of a notion of independence that generalizes linear independence in vector spaces … Wiktionary
Oriented matroid — theory allows a combinatorial approach to the max flow min cut theorem. A network with the value of flow equal to the capacity of an s t cut An oriented matroid is a mathematical structure that abstracts the properties of directed graphs and of… … Wikipedia
Dimension (vector space) — In mathematics, the dimension of a vector space V is the cardinality (i.e. the number of vectors) of a basis of V. It is sometimes called Hamel dimension or algebraic dimension to distinguish it from other types of dimension. This description… … Wikipedia
Duality (mathematics) — In mathematics, a duality, generally speaking, translates concepts, theorems or mathematical structures into other concepts, theorems or structures, in a one to one fashion, often (but not always) by means of an involution operation: if the dual… … Wikipedia
Signed graph — In the area of graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign.Formally, a signed graph Sigma; is a pair ( G , sigma;) that consists of a graph G = ( V , E ) and a sign mapping or… … Wikipedia
Dowling geometry — In combinatorial mathematics, a Dowling geometry, named after Thomas A. Dowling, is a matroid associated with a group. There is a Dowling geometry of each rank for each group. If the rank is at least 3, the Dowling geometry uniquely determines… … Wikipedia
Pseudoforest — A 1 forest (a maximal pseudoforest), formed by three 1 trees In graph theory, a pseudoforest is an undirected graph[1] in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of ve … Wikipedia
Combinatorics — is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size (enumerative combinatorics), deciding when certain criteria can be met,… … Wikipedia
Roman letters used in mathematics — NOTOC Many Roman letters, both capital and small, are used in mathematics, science and engineering to denote by convention specific or abstracted constants, variables of a certain type, units, multipliers, physical entities. Certain letters, when … Wikipedia
Ordinal optimization — In mathematical optimization, ordinal optimization is the maximization of functions taking values in a partially ordered set ( poset ). Ordinal optimization has applications in the theory of queuing networks. Contents 1 Mathematical foundations 1 … Wikipedia
